Then, a priority message queue is designed, and weighted fair queuing ( wfq ) algorithm is used for messages queuing 其次,設(shè)計了可靠的消息隊列,并采用平均加權(quán)算法對消息進行排隊,支持優(yōu)先級機制。
weighted fair queuing ( wfq ), on the other hand, allows allocation of bandwidth on a variable basis, so not all flows have to have the same bandwidth allocation 另一方面,加權(quán)公平排隊(wfq)允許在可變的基礎(chǔ)上分配帶寬,因而不是所有的信息流都必須有相同的帶寬分配。
3 . resource management algorithm of guarantee qos routing is given, which has proposed a new algorithm with gloal minimum jitter under the weighted fair queue 給出了保證qos路由算法的網(wǎng)絡(luò)資源管理算法,并重點給出了在加權(quán)公平意義下的隊列的數(shù)據(jù)傳輸?shù)娜侄秳幼钚∷惴ā?i class="labawb" onClick="playMp3('sound_c_3')">
,: after review fair queuing algorithms, the chapter 5 places emphasis on wfq ( weighted fair queuing ) performance analysis and concludes that wfq has certain capability of resisting h 第五章首先介紹了幾種公平排隊算法,重點分析了wfq的性能,得出了wfq具有一定的抗高等級突發(fā)的能力,該能力和業(yè)務(wù)的突發(fā)程度、系統(tǒng)負荷和各等級的權(quán)值分配有關(guān)。
After that, qos management methods are introduced, including packet classification, congestion control and buffer queue management . several queuing principles are compared such as fifo queuing, prioritized queuing and weighted fair queuing . tail drop and active queue management are also introduced in this part 同時對epon系統(tǒng)采用的qos管理策略做了詳細的闡述,分析了報文分類方法、擁塞管理策略、緩沖隊列管理策略,對比了fifo隊列、pq隊列和wfq隊列等幾種主要的隊列特點,以及尾丟棄和主動隊列管理aqm的區(qū)別。
Although the congestion control research of host-ends has made great strides, the current queue management mechanism in router is not able to provide end-to-end congestion control mechanism to sustain the above environment, namely, the unfairness of assigned bandwidth or drop-rate for different types of flows and the synchronization of all tcp flows in network . so it is necessary to improve the classical queue management mecnanism such as drop _ tail and red in order to boost the qos ( quality of service ) . this article analyzes the main traits of host-ends congestion control and all kinds of fashionable queue management machanism, which include queue mechanism with absolute priority, weighted fair queue mechanism and class-based queue mechanism 本文分析了主機端的擁塞控制機制和網(wǎng)絡(luò)中路由器的現(xiàn)有各種隊列管理機制:絕對優(yōu)先級隊列機制、加權(quán)公平隊列(weightedfairqueue)[1]機制、基于類的隊列(class-basedqueue)[2]機制以及red(randomearlydetection)[3]機制的主要特點,并重點針對ietf(internetengineeringtaskforce)推薦的把red算法與明確的擁塞通告ecn(explicitcongestionnotification)[4]結(jié)合的方法進行了分析,發(fā)現(xiàn)隨著internet流量的日益遞增,red機制的依賴平均隊列長度來管理擁塞控制的算法并不能有效地阻止包丟失:與drop-tail相比,red確實消除了對陣發(fā)流量(tcp)的偏見,但是增加了平滑流量(udp)的丟包概率。